Fourier Transform on the Hypercube
نویسنده
چکیده
Definitions Let F be the real vector space of real functions on 2 [n] (the set of subsets of [n] = {1,. .. , n}). Define an inner product on F by f, g = 1 2 n A⊆[n] f (A)g(A). For S ⊆ [n], let x S ∈ F be the function x S (A) = (−1) |A∩S|. Now we compute x S , x T = 1 2 n A⊆[n]
منابع مشابه
A Performance Assessment of Express on the iPSC/2 and iPSC/860 Hypercube Computers
Abstract This paper describes the performance evaluation of Express programming environment on the iPSC/2 and iPSC/860 hypercube computers. Express allows parallel programs to be developed in a completely portable fashion and is available on most commercially available parallel computers as well as networks of workstations. We have developed a set of benchmarks to make a comprehensive performan...
متن کاملMixing of Quantum Walks on Generalized Hypercubes
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the...
متن کاملOptimal Matrix Transposition and Bit Reversal on Hypercubes: All-to-All Personalized Communication
In a hypercube multiprocessor with distributed memory, messages have a street address and an apartment number, i.e., a hypercube node address and a local memory address. Here we describe an optimal algorithm for performing the communication described by exchanging the bits of the node address with that of the local address. These exchanges occur typically in both matrix transposition and bit re...
متن کاملAn exact, cache-localized algorithm for the sub-quadratic convolution of hypercubes
Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A method is proposed for performing exact hypercube convolution in sub-quadratic time. The method outperforms FFTPACK, called via numpy, and FFTW, called via pyfftw...
متن کاملFractional Fourier Transform Based OFDMA for Doubly Dispersive Channels
The performance of Orthogonal Frequency Division Multiple Access (OFDMA) system degrades significantly in doubly dispersive channels. This is due to the fact that exponential sub-carriers do not match the singular functions of this type of channels. To solve this problem, we develop a system whose sub-carriers are chirp functions. This is equivalent to exploiting Fractional Fourier Transform (F...
متن کاملOn The Simulation of Partial Differential Equations Using the Hybrid of Fourier Transform and Homotopy Perturbation Method
In the present work, a hybrid of Fourier transform and homotopy perturbation method is developed for solving the non-homogeneous partial differential equations with variable coefficients. The Fourier transform is employed with combination of homotopy perturbation method (HPM), the so called Fourier transform homotopy perturbation method (FTHPM) to solve the partial differential equations. The c...
متن کامل